Sciweavers

17 search results - page 2 / 4
» On Stateless Multicounter Machines
Sort
View
JUCS
2002
73views more  JUCS 2002»
13 years 4 months ago
Some Remarks on Codes Defined by Petri Nets
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequ...
Masami Ito, Jürgen Dassow, Ralf Stiebe
ICWE
2011
Springer
12 years 8 months ago
Formal Modeling of RESTful Systems Using Finite-State Machines
Representational State Transfer (REST), as an architectural style for distributed hypermedia systems, enables scalable operation of the World Wide Web (WWW) and is the foundation f...
Ivan Zuzak, Ivan Budiselic, Goran Delac
IJFCS
2007
100views more  IJFCS 2007»
13 years 4 months ago
On the Power of Deterministic and Sequential Communicating P Systems
We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in...
Ludek Cienciala, Lucie Ciencialová, Pierlui...
TIME
2006
IEEE
13 years 10 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
CAV
2000
Springer
141views Hardware» more  CAV 2000»
13 years 8 months ago
Binary Reachability Analysis of Discrete Pushdown Timed Automata
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard ...