Timed Basic Parallel Processes
release_zh3rtg2wivgwvijuzrrt2jvlky
by
Lorenzo Clemente,
Piotr Hofman,
Patrick Totzke,
Michael Wagner
References
NOTE: currently batch computed and may include additional references sources, or be missing recent changes, compared to entity reference list.| Showing 1 - 30 of 46 references (in 77ms) | ||
|---|---|---|
[b0]via grobid |
Timed Lossy Channel Systems
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg, Marc Herbstritt 2012 Foundations of Software Technology and Theoretical Computer Science doi:10.4230/lipics.fsttcs.2012.374 dblp:conf/fsttcs/AbdullaAC12 |
web.archive.org
[PDF]
|
[b1]via grobid |
Dense-Timed Pushdown Automata
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman 2012 Logic in Computer Science doi:10.1109/lics.2012.15 dblp:conf/lics/AbdullaAS12 |
web.archive.org
[PDF]
|
[b2]via grobid |
Universal Safety for Timed Petri Nets is PSPACE-complete
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke, Michael Wagner 2018 International Conference on Concurrency Theory doi:10.4230/lipics.concur.2018.6 dblp:conf/concur/AbdullaACMT18 |
web.archive.org
[PDF]
|
[b3]via grobid |
Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Shankara Narayanan Krishna. Perfect Timed Communication Is Hard. In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), 2018.
| |
[b4]via grobid |
Model checking of systems with many identical timed processes
Parosh Aziz Abdulla, Bengt Jonsson 2003 Theoretical Computer Science doi:10.1016/s0304-3975(01)00330-9 |
web.archive.org
[PDF]
|
[b5]via grobid |
Parosh Aziz Abdulla and Aletta Nylén. Timed Petri Nets and BQOs. In Applications and Theory of Petri Nets and Concurrency (PETRI NETS), 2001.
| |
[b6]via grobid |
A theory of timed automata
Rajeev Alur, David L. Dill 1994 Theoretical Computer Science doi:10.1016/0304-3975(94)90010-8 |
web.archive.org
[PDF]
|
[b7]via grobid |
Analysis of Timed Recursive State Machines
Massimo Benerecetti, Stefano Minopoli, Adriano Peron 2010 International Symposium/Workshop on Temporal Representation and Reasoning doi:10.1109/time.2010.10 dblp:conf/time/BenerecettiMP10 | |
[b8]via grobid |
Timed recursive state machines: Expressiveness and complexity
Massimo Benerecetti, Adriano Peron 2016 Theoretical Computer Science doi:10.1016/j.tcs.2016.02.021 | |
[b9]via grobid |
Beatrice Bérard, Anne Labroue, and Philippe Schnoebelen. Verifying Performance Equivalence for Timed Basic Parallel Processes. In International Conference on Foundations of Software Science and Computational Structures (FoSSaCS), 2000.
| |
[b10]via grobid |
An effective decision procedure for linear arithmetic over the integers and reals
Bernard Boigelot, Sébastien Jodogne, Pierre Wolper 2005 ACM Transactions on Computational Logic doi:10.1145/1071596.1071601 |
web.archive.org
[PDF]
|
[b11]via grobid |
Ahmed Bouajjani, Rachid Echahed, and Riadh Robbana. On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures. In Hybrid Systems (HS), 1994.
| |
[b12]via grobid |
Patricia Bouyer, Kim G. Larsen, Nicolas Markey, and Jacob Illum Rasmussen. Almost Optimal Strategies in One Clock Priced Timed Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2006.
| |
[b13]via grobid |
Søren Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, School of Informatics, University of Edinburgh, 1993.
| |
[b14]via grobid |
Decidability of Timed Communicating Automata
[article]
Lorenzo Clemente 2018 pre-print version:v1 arXiv:1804.07815v1 |
web.archive.org
[PDF]
|
[b15]via grobid |
Reachability of Communicating Timed Processes
[chapter]
Lorenzo Clemente, Frédéric Herbreteau, Amelie Stainer, Grégoire Sutre 2013 Lecture Notes in Computer Science doi:10.1007/978-3-642-37075-5_6 |
web.archive.org
[PDF]
|
[b16]via grobid |
Timed Basic Parallel Processes
[article]
Lorenzo Clemente and Piotr Hofman and Patrick Totzke 2019 pre-print version:v1 arXiv:1907.01240v1 |
web.archive.org
[PDF]
|
[b17]via grobid |
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms
Lorenzo Clemente, Slawomir Lasota, Michael Wagner 2018 International Colloquium on Automata, Languages and Programming doi:10.4230/lipics.icalp.2018.118 dblp:conf/icalp/ClementeL18 |
web.archive.org
[PDF]
|
[b18]via fuzzy |
Timed pushdown automata and branching vector addition systems
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki 2017 Logic in Computer Science doi:10.1109/lics.2017.8005083 dblp:conf/lics/ClementeLLM17 |
web.archive.org
[PDF]
|
[b19]via grobid |
Hubert Comon and Yan Jurski. Timed Automata and the Theory of Real Numbers. In International Conference on Concurrency Theory (CONCUR), 1999.
| |
[b20]via grobid |
Zhe Dang. Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks. In Computer Aided Verification (CAV), 2001.
| |
[b21]via grobid |
Computing reachability relations in timed automata
C. Dima Logic in Computer Science doi:10.1109/lics.2002.1029827 dblp:conf/lics/Dima02 | |
[b22]via grobid |
Catalin Dima. A Class of Automata for Computing Reachability Relations in Timed Systems. In Verification of Infinite State Systems with Applications to Security (VISSAS), 2005.
| |
[b23]via grobid |
Javier Esparza. Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. Fundamenta Informaticae, 1997.
| |
[b24]via grobid |
Reachability in two-clock timed automata is PSPACE-complete
John Fearnley, Marcin Jurdziński 2015 Information and Computation doi:10.1016/j.ic.2014.12.004 | |
[b25]via grobid |
Jeanne Ferrante and Charles Rackoff. A Decision Procedure for the First Order Theory of Real Addition with Order. SIAM Journal on Computing, 1975.
| |
[b26]via fuzzy |
Effective Definability of the Reachability Relation in Timed Automata
Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell 2019 Information Processing Letters doi:10.1016/j.ipl.2019.105871 | |
[b27]via grobid |
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen 2012 Logic in Computer Science doi:10.1109/lics.2012.46 dblp:conf/lics/HaddadSS12 |
web.archive.org
[PDF]
|
[b28]via grobid |
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, and Peter Bro Miltersen. A Faster Algorithm for Solving One-Clock Priced Timed Games. In International Conference on Concurrency Theory (CONCUR), 2013.
| |
[b29]via grobid |
Marcin Jurdziński and Ashutosh Trivedi. Reachability-time Games on Timed Automata. In International Colloquium on Automata, Languages and Programming (ICALP), 2007.
| |
|
| ||