Maciej Szreter

According to our database1, Maciej Szreter authored at least 27 papers between 2000 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Combining ontology reductions with new approaches to automated abstract planning of Planics.
Appl. Soft Comput., 2017

2016
A Graph-based Reduction in Planics Abstract Planning, Based on Partial Orders of Services (extended abstract).
Proceedings of the 25th International Workshop on Concurrency, 2016

2015
Automated Two-Phase Composition of Timed Web Services.
Proceedings of the Perspectives of System Informatics, 2015

2014
SMT Versus Genetic and OpenOpt Algorithms: Concrete Planning in the PlanICS Framework.
Fundam. Informaticae, 2014

BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance.
Auton. Agents Multi Agent Syst., 2014

2013
Modularity and Openness in Modeling Multi-Agent Systems.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

2012
Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios.
Fundam. Informaticae, 2012

Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge.
Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

Bounded Model Checking for Linear Time Temporal-Epistemic Logic.
Proceedings of the 2012 Imperial College Computing Student Workshop, 2012

Bounded model checking for knowledge and linear time.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
Runtime Monitoring of Contract Regulated Web Services.
Fundam. Informaticae, 2011

PlanICS - a Web Service Composition Toolset.
Fundam. Informaticae, 2011

2010
Bounded Parametric Model Checking for Elementary Net Systems.
Trans. Petri Nets Other Model. Concurr., 2010

Parametric Model Checking with VerICS.
Trans. Petri Nets Other Model. Concurr., 2010

Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics.
Fundam. Informaticae, 2010

2009
A New Approach to Model Checking of UML State Machines.
Fundam. Informaticae, 2009

Simulation of Security Protocols based on Scenarios of Attacks.
Fundam. Informaticae, 2009

Towards Checking Parametric Reachability for UML State Machines.
Proceedings of the Perspectives of Systems Informatics, 2009

2008
SAT-based Unbounded Model Checking of Timed Automata.
Fundam. Informaticae, 2008

VerICS 2007 - a Model Checker for Knowledge and Real-Time.
Fundam. Informaticae, 2008

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

2005
Selective Search in Bounded Model Checking of Reachability Properties.
Proceedings of the Automated Technology for Verification and Analysis, 2005

2004
Verifying Multi-agent Systems via Unbounded Model Checking.
Proceedings of the Formal Approaches to Agent-Based Systems, Third InternationalWorkshop, 2004

2003
Reachability Analysis for Timed Automata Using Partitioning Algorithms.
Fundam. Informaticae, 2003

Verics: A Tool for Verifying Timed Automata and Estelle Specifications.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Towards Efficient Partition Refinement for Checking Reachability in Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

2000
Improving Partial Order Reductions for Universal Branching Time Properties.
Fundam. Informaticae, 2000


  Loading...