Wojciech Penczek

Fundam. Informaticae, 2021

Preface.

[BibT_eX]

[DOI]

Jörg Keller

Fundam. Informaticae, 2021

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees.

[BibT_eX]

[DOI]

CoRR, 2021

SMT-Based Unbounded Model Checking for ATL.

[BibT_eX]

[DOI]

Proceedings of the Verification and Evaluation of Computer and Communication Systems, 2021

Satisfiability Checking of Strategy Logic with Simple Goals.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them.

[BibT_eX]

[DOI]

Teofil Sidoruk

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Strategic Abilities of Asynchronous Agents: Semantic Side Effects.

[BibT_eX]

[DOI]

Teofil Sidoruk

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

ADT2AMAS: Managing Agents in Attack-Defence Scenarios.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Towards Partial Order Reductions for Strategic Ability.

[BibT_eX]

[DOI]

Antoni W. Mazurkiewicz

J. Artif. Intell. Res., 2020

Multi-valued Verification of Strategic Ability.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

Strategic Abilities of Asynchronous Agents: Semantic Paradoxes and How to Tame Them.

[BibT_eX]

[DOI]

Teofil Sidoruk

CoRR, 2020

SAT-Based ATL Satisfiability Checking.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods and Software Engineering, 2020

MsATL: A Tool for SAT-Based ATL Satisfiability Checking.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Parametric Verification: An Introduction.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2019

Timed ATL: Forget Memory, Just Count.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Preface.

[BibT_eX]

[DOI]

Holger Schlingloff

Piotr Wasilewski

Fundam. Informaticae, 2019

Applying Modern SAT-solvers to Solving Hard Problems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2019

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2019

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems.

[BibT_eX]

[DOI]

CoRR, 2019

Squeezing State Spaces of (Attack-Defence) Trees.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Engineering of Complex Computer Systems, 2019

All True Concurrency Models Start with Petri Nets: A Personal Tribute to Carl Adam Petri.

[BibT_eX]

[DOI]

Proceedings of the Carl Adam Petri: Ideas, Personality, Impact, 2019

2018

TripICS - a Web Service Composition System for Planning Trips and Travels.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Preface.

[BibT_eX]

[DOI]

Wil M. P. van der Aalst

Eike Best

Fundam. Informaticae, 2018

SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME.

[BibT_eX]

[DOI]

Sci. Ann. Comput. Sci., 2018

Reaction Mining for Reaction Systems.

[BibT_eX]

[DOI]

Maciej Koutny

Proceedings of the Unconventional Computation and Natural Computation, 2018

Improving Efficiency of Model Checking for Variants of Alternating-time Temporal Logic.

[BibT_eX]

[DOI]

Proceedings of the 27th International Workshop on Concurrency, 2018

Towards Partial Order Reductions for Strategic Ability.

[BibT_eX]

[DOI]

Piotr Dembinski

Antoni W. Mazurkiewicz

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Verification of Linear-Time Temporal Properties for Reaction Systems with Discrete Concentrations.

[BibT_eX]

[DOI]

Maciej Koutny

Fundam. Informaticae, 2017

Combining ontology reductions with new approaches to automated abstract planning of Planics.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2017

2016

SMT-Based Parameter Synthesis for Parametric Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Challenging Problems and Solutions in Intelligent Systems, 2016

Concrete Planning in PlanICS Framework by Combining SMT with GEO and Simulated Annealing.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Preface.

[BibT_eX]

[DOI]

Raymond R. Devillers

Antti Valmari

Fundam. Informaticae, 2016

Preface.

[BibT_eX]

[DOI]

Ludwik Czaja

Krzysztof Stencel

Fundam. Informaticae, 2016

Towards Quantitative Verification of Reaction Systems.

[BibT_eX]

[DOI]

Maciej Koutny

Proceedings of the Unconventional Computation and Natural Computation, 2016

TripICS - a Web Service Composition System for Planning Trips and Travels (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the 25th International Workshop on Concurrency, 2016

Multi-Valued Verification of Strategic Ability.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Controlling Actions and Time in Parametric Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Application of Concurrency to System Design, 2016

2015

SMT-Based Abstract Parametric Temporal Planning.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2015

Action Synthesis for Branching Time Logic: Theory and Applications.

[BibT_eX]

[DOI]

ACM Trans. Embed. Comput. Syst., 2015

Model checking temporal properties of reaction systems.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Inf. Sci., 2015

Generating None-Plans in Order to Find Plans.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering and Formal Methods - 13th International Conference, 2015

Hybrid Planning by Combining SMT and Simulated Annealing.

[BibT_eX]

[DOI]

Proceedings of the 24th International Workshop on Concurrency, 2015

2014

Preface.

[BibT_eX]

[DOI]

Ludwik Czaja

Fundam. Informaticae, 2014

SMT Versus Genetic and OpenOpt Algorithms: Concrete Planning in the PlanICS Framework.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Parameter Synthesis for Timed Kripke Structures.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2014

A Hybrid Approach to Web Service Composition Problem in the PlanICS Framework.

[BibT_eX]

[DOI]

Proceedings of the Mobile Web Information Systems - 11th International Conference, 2014

Fixed-Point Methods in Parametric Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems'2014, 2014

PlanICS 2.0 - A Tool for Composing Services.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Petri Nets and Software Engineering, 2014

SMT-based Abstract Temporal Planning.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Petri Nets and Software Engineering, 2014

2013

Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2013

Preface.

[BibT_eX]

[DOI]

Lars Michael Kristensen

Laure Petrucci

Fundam. Informaticae, 2013

Evolutionary Algorithms for Abstract Planning.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2013

Towards SMT-based Abstract Planning in PlanICS Ontology.

[BibT_eX]

[DOI]

Proceedings of the KEOD 2013, 2013

Automated abstract planning with use of genetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

SMT vs Genetic Algorithms: Concrete Planning in PlanICS Framework.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Workshop on Concurrency, 2013

2012

Applying Timed Automata to Model Checking of Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Bounded Model Checking for Parametric Timed Automata.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2012

Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

HarmonICS - a Tool for Composing Medical Services.

[BibT_eX]

[DOI]

Proceedings of the 4th Central-European Workshop on Services and their Composition, 2012

Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

Bounded Model Checking for Linear Time Temporal-Epistemic Logic.

[BibT_eX]

[DOI]

Proceedings of the 2012 Imperial College Computing Student Workshop, 2012

Symbolic Model Checking for Temporal-Epistemic Logic.

[BibT_eX]

[DOI]

Proceedings of the Logic Programs, Norms and Action, 2012

SMT-based parameter synthesis for L/U automata.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Petri Nets and Software Engineering, 2012

Bounded model checking for knowledge and linear time.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Group synthesis for parametric temporal-epistemic logic.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Runtime Monitoring of Contract Regulated Web Services.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Preface.

[BibT_eX]

[DOI]

Johan Lilius

Fundam. Informaticae, 2011

PlanICS - a Web Service Composition Toolset.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Specification and Verification of Multi-Agent Systems.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Logic and Computation, 2011

Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Petri Nets and Software Engineering, 2011

2010

SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2010

Bounded Parametric Model Checking for Elementary Net Systems.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2010

Parametric Model Checking with VerICS.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2010

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems.

[BibT_eX]

[DOI]

Hongyang Qu

Fundam. Informaticae, 2010

Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Preface.

[BibT_eX]

[DOI]

Giuliana Franceschinis

Karsten Wolf

Fundam. Informaticae, 2010

Towards Automatic Composition of Web Services: A SAT-Based Phase.

[BibT_eX]

[DOI]

Proceedings of the Workshops of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (PETRI NETS 2010) and of the 10th International Conference on Application of Concurrency to System Design (ACSD 2010), 2010

2009

A New Approach to Model Checking of UML State Machines.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Timed Automata Based Model Checking of Timed Security Protocols.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Simulation of Security Protocols based on Scenarios of Attacks.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Towards Checking Parametric Reachability for UML State Machines.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2009

2008

SAT-based Unbounded Model Checking of Timed Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

LDYIS: a Framework for Model Checking Security Protocols.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

VerICS 2007 - a Model Checker for Knowledge and Real-Time.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic.

[BibT_eX]

[DOI]

Hongyang Qu

Proceedings of the Model Checking and Artificial Intelligence, 5th International Workshop, 2008

2007

Symbolic model checking for temporal-epistemic logics.

[BibT_eX]

[DOI]

SIGACT News, 2007

Verifying Security Protocols Modelled by Networks of Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Path Compression in Timed Automata.

[BibT_eX]

[DOI]

Agata Janowska

Fundam. Informaticae, 2007

Modelling and Checking Timed Authentication of Security Protocols.

[BibT_eX]

[DOI]

Gizela Jakubowska

Fundam. Informaticae, 2007

Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics

[BibT_eX]

[DOI]

CoRR, 2007

Bounded model checking for knowledge and real time.

[BibT_eX]

[DOI]

Artif. Intell., 2007

Is Your Security Protocol on Time ?

[BibT_eX]

[DOI]

Gizela Jakubowska

Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

2006

Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach.

[BibT_eX]

[DOI]

Studies in Computational Intelligence 20, Springer, ISBN: 978-3-540-32869-8, 2006

Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

SAT-Based Verification of Security Protocols Via Translation to Networks of Automata.

[BibT_eX]

[DOI]

Proceedings of the Model Checking and Artificial Intelligence, 4th Workshop, 2006

Model checking for multivalued logic of knowledge and time.

[BibT_eX]

[DOI]

Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

2005

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2005

2004

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic.

[BibT_eX]

[DOI]

Synth., 2004

Minimization Algorithms for Time Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2004

On Designated Values in Multi-valued CTL* Model Checking.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2004

From Bounded to Unbounded Model Checking for Temporal Epistemic Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2004

Bounded Model Checking for Deontic Interpreted Systems.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Logic and Communication in Multi-Agent Systems, 2004

Verifying Multi-agent Systems via Unbounded Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Formal Approaches to Agent-Based Systems, Third InternationalWorkshop, 2004

Unbounded Model Checking for Alternating-Time Temporal Logic.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Verification of Multiagent Systems via Unbounded Model Checking.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Applications and Theory of Petri Nets 2004, 2004

2003

Checking Reachability Properties for Timed Automata via SAT.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Reachability Analysis for Timed Automata Using Partitioning Algorithms.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Verics: A Tool for Verifying Timed Automata and Estelle Specifications.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Towards Efficient Partition Refinement for Checking Reachability in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

2002

Bounded Model Checking for the Universal Fragment of CTL.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

Verification of Timed Automata Based on Similarity.

[BibT_eX]

[DOI]

Piotr Dembinski

Fundam. Informaticae, 2002

Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties.

[BibT_eX]

[DOI]

Henri Hansen

Antti Valmari

Proceedings of the 7th International ERCIM Workshop in Formal Methods for Industrial Critical Systems, 2002

Towards Bounded Model Checking for the Universal Fragment of TCTL.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results.

[BibT_eX]

[DOI]

T. Lasica

Proceedings of the Formal Approaches to Agent-Based Systems, Second International Workshop, 2002

Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

Automated Verification of Infinite State Concurrent Systems.

[BibT_eX]

[DOI]

Piotr Dembinski

Proceedings of the Parallel Processing and Applied Mathematics, 2001

Efficient Model Checking of Causal-Knowledge Protocols.

[BibT_eX]

[DOI]

Proceedings of the From Theory to Practice in Multi-Agent Systems, 2001

Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 2001, 2001

2000

Temporal Approach to Causal Knowledge.

[BibT_eX]

[DOI]

Log. J. IGPL, 2000

Improving Partial Order Reductions for Universal Branching Time Properties.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

Modeling Agent Organizations.

[BibT_eX]

Krzysztof Cetnarowicz

Jaroslaw Kozlak

Tomasz Nowak

Proceedings of the Intelligent Information Systems, 2000

Towards Formal Specification and Verification in Cyberspace.

[BibT_eX]

[DOI]

Tomasz Nowak

Proceedings of the Formal Approaches to Agent-Based Systems, First International Workshop, 2000

1999

A Partial Order Approach to Branching Time Logic Model Checking.

[BibT_eX]

[DOI]

Inf. Comput., 1999

Model checking of causal knowledge formulas.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Distributed Systems, 1999

Local Interactions, Explicit Communication and Causal Knowledge in Games and Multi-Agent Systems.

[BibT_eX]

Proceedings of the 1st International Workshop of Central and Eastern Europe on Multi-Agent Systems, 1999

1998

Team Formation by Self-Interested Mobile Agents.

[BibT_eX]

[DOI]

Olaf Matyja

Proceedings of the Multi-Agent Systems: Theories, 1998

1997

Model-Checking for a Subclass of Event Structures.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1997

1996

Axiomatizations of Temporal Logics on Trace Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

A complete axiomatization of a first-order temporal logic over trace systems.

[BibT_eX]

[DOI]

Marian Srebrny

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

1995

Using asynchronous Büchi automata for efficient automatic verification of concurrent systems.

[BibT_eX]

Doron A. Peled

Proceedings of the Protocol Specification, 1995

Model-Checking of Causality Properties

[BibT_eX]

[DOI]

Rajeev Alur

Doron A. Peled

Proceedings of the Proceedings, 1995

Traces and Logic.

[BibT_eX]

[DOI]

Ruurd Kuiper

Proceedings of the Book of Traces, 1995

1994

A Hierarchy of Partial Order Temporal Properties.

[BibT_eX]

[DOI]

Marta Z. Kwiatkowska

Doron A. Peled

Proceedings of the Temporal Logic, First International Conference, 1994

1993

Temporal Logics for Trace Systems: On Automated Verification.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

1992

On Undecidability of Propositional Temporal Logics on Trace Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Propositional Temporal Logics and Equivalences.

[BibT_eX]

[DOI]

Ursula Goltz

Ruurd Kuiper

Proceedings of the CONCUR '92, 1992

1990

Inevitability in diamond processes.

[BibT_eX]

[DOI]

Edward Ochmanski

RAIRO Theor. Informatics Appl., 1990

1989

Concurrent Systems and Inevitability.

[BibT_eX]

[DOI]

Antoni W. Mazurkiewicz

Edward Ochmanski

Theor. Comput. Sci., 1989

A Temporal Logic for the Local Specification of Concurrent Systems.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

A Concurrent Branching Time Temporal Logic.

[BibT_eX]

[DOI]